a multi-level capacitated lot-sizing problem with safety stock deficit and production manners: a revised simulated annealing

نویسندگان

esameil mehdizadeh

mohammad reza mohammadizadeh

چکیده

[1] corresponding author e-mail: [email protected]   [1] corresponding author e-mail: [email protected]   lot-sizing problems (lsps) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. this paper aims at developing a new mathematical model for the multi-level capacitated lsp with setup times, safety stock deficit, shortage, and different production manners. since the proposed linear mixed integer programming model is np-hard, a new version of simulated annealing algorithm (sa) is developed to solve the model named revised sa algorithm (rsa). since the performance of the meta-heuristics severely depends on their parameters, taguchi approach is applied to tune the parameters of both sa and rsa. in order to justify the proposed mathematical model, we utilize an exact approach to compare the results. to demonstrate the efficiency of the proposed rsa, first, some test problems are generated; then, the results are statistically and graphically compared with the traditional sa algorithm.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi-level Capacitated Lot-sizing Problem with Safety Stock Deficit and Production Manners: A Revised Simulated Annealing

[1] Corresponding author e-mail: [email protected]   [1] Corresponding author e-mail: [email protected]   Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level ca...

متن کامل

A Multi-level Capacitated Lot-sizing Problem with Safety Stock Deficit and Production Manners: A Revised Simulated Annealing

Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level capacitated LSP with setup times, safety stock deficit, shortage, and different production manners. Since the proposed linear mixed integ...

متن کامل

Capacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm

This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical ...

متن کامل

OPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...

متن کامل

Formulation and Solution ofTwo-Level Capacitated Lot-Sizing Problem

The integration of sequencing decisions in lot-sizing and scheduling problems has received an increased attention from the research community due to its inherent applicability to the real-world problems. In this paper, we develop and solve a synchronized and integrated two-level lot-sizing and scheduling problem motivated by a real-world problem arisen in the soft drink production. The soft dri...

متن کامل

www.econstor.eu A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problem

This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized over all real-valued variables, but only a small subset of binary setup variables. The remaining binary...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of optimization in industrial engineering

ناشر: qiau

ISSN 2251-9904

دوره 6

شماره 13 2013

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023